XML subtree reconstruction from relational storage of XML documents

Numerous researchers have proposed to use relational databases to store and query XML documents. In these systems, the elements selected by an XML query are returned to an application either by select mode or by reconstruct mode. For the reconstruct mode, the XML subtrees that are rooted at the selected elements need to be extracted and reconstructed from the relational storage of XML documents. Therefore, XML subtree reconstruction is an important problem since its efficiency has a significant impact on XML query response time. In this paper, we propose (i) a linear XML subtree reconstruction algorithm Reconstruct to reconstruct an XML subtree from the structure-encoded sequence of the subtree that is extracted from the relational database by a structure-encoded sequence retrieval algorithm, (ii) a generic efficient structureencoded sequence retrieval algorithm RD-SB for a schema-based relational XML storage, and (iii) a generic efficient structure-encoded sequence retrieval algorithm RD-SL for a schema-less relational XML storage. To the best of our knowledge, our algorithms provide the first generic solutions to the XML subtree reconstruction problem that are applicable to all relational XML storage schemes proposed in the literature. Finally, our experiments show that our algorithms are efficient and scalable. 2006 Elsevier B.V. All rights reserved.